Left Termination proof of /tmp/tmpJUcccP/parse.pl

Left Termination of the query pattern parse_in_2(g, a) w.r.t. the given Prolog program could successfully be proven:

↳ Prolog

  ↳ PrologToPiTRSProof

Clauses:

parse(Xs, T) :- ','(app(As, .(a, .(s(A, B, C), .(b, Bs))), Xs), ','(app(As, .(s(a, s(A, B, C), b), Bs), Ys), parse(Ys, T))).
parse(Xs, T) :- ','(app(As, .(a, .(s(A, B), .(b, Bs))), Xs), ','(app(As, .(s(a, s(A, B), b), Bs), Ys), parse(Ys, T))).
parse(Xs, T) :- ','(app(As, .(a, .(b, Bs)), Xs), ','(app(As, .(s(a, b), Bs), Ys), parse(Ys, T))).
parse(.(s(A, B), []), s(A, B)).
parse(.(s(A, B, C), []), s(A, B, C)).
app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).

Queries:

parse(g,a).

We use the technique of [30]. With regard to the inferred argument filtering the predicates were used in the following modes:
parse_in: (b,f)
app_in: (f,f,b) (b,b,f)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

PARSE_IN_GA(Xs, T) → U1_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
PARSE_IN_GA(Xs, T) → APP_IN_AAG(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)
APP_IN_AAG(.(X, Xs), Ys, .(X, Zs)) → U10_AAG(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
APP_IN_AAG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_AAG(Xs, Ys, Zs)
U1_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
U1_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → APP_IN_GGA(As, .(s(a, s(A, B, C), b), Bs), Ys)
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → U10_GGA(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)
U2_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_GA(Xs, T, parse_in_ga(Ys, T))
U2_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
PARSE_IN_GA(Xs, T) → U4_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
PARSE_IN_GA(Xs, T) → APP_IN_AAG(As, .(a, .(s(A, B), .(b, Bs))), Xs)
U4_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U4_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → APP_IN_GGA(As, .(s(a, s(A, B), b), Bs), Ys)
U5_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_GA(Xs, T, parse_in_ga(Ys, T))
U5_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
PARSE_IN_GA(Xs, T) → U7_GA(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
PARSE_IN_GA(Xs, T) → APP_IN_AAG(As, .(a, .(b, Bs)), Xs)
U7_GA(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_GA(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U7_GA(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → APP_IN_GGA(As, .(s(a, b), Bs), Ys)
U8_GA(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_GA(Xs, T, parse_in_ga(Ys, T))
U8_GA(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → PARSE_IN_GA(Ys, T)

The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

The argument filtering Pi contains the following mapping:
parse_in_ga(x1, x2) = parse_in_ga(x1)
U1_ga(x1, x2, x3) = U1_ga(x3)
app_in_aag(x1, x2, x3) = app_in_aag(x3)
app_out_aag(x1, x2, x3) = app_out_aag(x1, x2)
.(x1, x2) = .(x1, x2)
U10_aag(x1, x2, x3, x4, x5) = U10_aag(x1, x5)
a = a
s(x1, x2, x3) = s(x1, x2, x3)
b = b
U2_ga(x1, x2, x3) = U2_ga(x3)
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
[] = []
app_out_gga(x1, x2, x3) = app_out_gga(x3)
U10_gga(x1, x2, x3, x4, x5) = U10_gga(x1, x5)
U3_ga(x1, x2, x3) = U3_ga(x3)
U4_ga(x1, x2, x3) = U4_ga(x3)
s(x1, x2) = s(x1, x2)
U5_ga(x1, x2, x3) = U5_ga(x3)
U6_ga(x1, x2, x3) = U6_ga(x3)
U7_ga(x1, x2, x3) = U7_ga(x3)
U8_ga(x1, x2, x3) = U8_ga(x3)
U9_ga(x1, x2, x3) = U9_ga(x3)
parse_out_ga(x1, x2) = parse_out_ga(x2)
APP_IN_GGA(x1, x2, x3) = APP_IN_GGA(x1, x2)
PARSE_IN_GA(x1, x2) = PARSE_IN_GA(x1)
U10_AAG(x1, x2, x3, x4, x5) = U10_AAG(x1, x5)
U5_GA(x1, x2, x3) = U5_GA(x3)
U4_GA(x1, x2, x3) = U4_GA(x3)
U7_GA(x1, x2, x3) = U7_GA(x3)
U8_GA(x1, x2, x3) = U8_GA(x3)
U6_GA(x1, x2, x3) = U6_GA(x3)
U10_GGA(x1, x2, x3, x4, x5) = U10_GGA(x1, x5)
APP_IN_AAG(x1, x2, x3) = APP_IN_AAG(x3)
U3_GA(x1, x2, x3) = U3_GA(x3)
U1_GA(x1, x2, x3) = U1_GA(x3)
U2_GA(x1, x2, x3) = U2_GA(x3)
U9_GA(x1, x2, x3) = U9_GA(x3)

We have to consider all (P,R,Pi)-chains

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

PARSE_IN_GA(Xs, T) → U1_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
PARSE_IN_GA(Xs, T) → APP_IN_AAG(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)
APP_IN_AAG(.(X, Xs), Ys, .(X, Zs)) → U10_AAG(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
APP_IN_AAG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_AAG(Xs, Ys, Zs)
U1_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
U1_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → APP_IN_GGA(As, .(s(a, s(A, B, C), b), Bs), Ys)
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → U10_GGA(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)
U2_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_GA(Xs, T, parse_in_ga(Ys, T))
U2_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
PARSE_IN_GA(Xs, T) → U4_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
PARSE_IN_GA(Xs, T) → APP_IN_AAG(As, .(a, .(s(A, B), .(b, Bs))), Xs)
U4_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U4_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → APP_IN_GGA(As, .(s(a, s(A, B), b), Bs), Ys)
U5_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_GA(Xs, T, parse_in_ga(Ys, T))
U5_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
PARSE_IN_GA(Xs, T) → U7_GA(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
PARSE_IN_GA(Xs, T) → APP_IN_AAG(As, .(a, .(b, Bs)), Xs)
U7_GA(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_GA(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U7_GA(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → APP_IN_GGA(As, .(s(a, b), Bs), Ys)
U8_GA(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_GA(Xs, T, parse_in_ga(Ys, T))
U8_GA(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → PARSE_IN_GA(Ys, T)

The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)

The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
APP_IN_GGA(x1, x2, x3) = APP_IN_GGA(x1, x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys) → APP_IN_GGA(Xs, Ys)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

APP_IN_GGA(.(X, Xs), Ys) → APP_IN_GGA(Xs, Ys)
The graph contains the following edges 1 > 1, 2 >= 2

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_AAG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_AAG(Xs, Ys, Zs)

The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_AAG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_AAG(Xs, Ys, Zs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
APP_IN_AAG(x1, x2, x3) = APP_IN_AAG(x3)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

APP_IN_AAG(.(X, Zs)) → APP_IN_AAG(Zs)

From the DPs we obtained the following set of size-change graphs:

APP_IN_AAG(.(X, Zs)) → APP_IN_AAG(Zs)
The graph contains the following edges 1 > 1

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

U2_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
U7_GA(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_GA(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U5_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
U8_GA(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
PARSE_IN_GA(Xs, T) → U1_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
PARSE_IN_GA(Xs, T) → U7_GA(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U4_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U1_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
PARSE_IN_GA(Xs, T) → U4_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))

The TRS R consists of the following rules:

parse_in_ga(Xs, T) → U1_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))
U1_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U2_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → U3_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U4_ga(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))
U4_ga(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_ga(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U5_ga(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → U6_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(Xs, T) → U7_ga(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U7_ga(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_ga(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U8_ga(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → U9_ga(Xs, T, parse_in_ga(Ys, T))
parse_in_ga(.(s(A, B), []), s(A, B)) → parse_out_ga(.(s(A, B), []), s(A, B))
parse_in_ga(.(s(A, B, C), []), s(A, B, C)) → parse_out_ga(.(s(A, B, C), []), s(A, B, C))
U9_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U6_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)
U3_ga(Xs, T, parse_out_ga(Ys, T)) → parse_out_ga(Xs, T)

The argument filtering Pi contains the following mapping:
parse_in_ga(x1, x2) = parse_in_ga(x1)
U1_ga(x1, x2, x3) = U1_ga(x3)
app_in_aag(x1, x2, x3) = app_in_aag(x3)
app_out_aag(x1, x2, x3) = app_out_aag(x1, x2)
.(x1, x2) = .(x1, x2)
U10_aag(x1, x2, x3, x4, x5) = U10_aag(x1, x5)
a = a
s(x1, x2, x3) = s(x1, x2, x3)
b = b
U2_ga(x1, x2, x3) = U2_ga(x3)
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
[] = []
app_out_gga(x1, x2, x3) = app_out_gga(x3)
U10_gga(x1, x2, x3, x4, x5) = U10_gga(x1, x5)
U3_ga(x1, x2, x3) = U3_ga(x3)
U4_ga(x1, x2, x3) = U4_ga(x3)
s(x1, x2) = s(x1, x2)
U5_ga(x1, x2, x3) = U5_ga(x3)
U6_ga(x1, x2, x3) = U6_ga(x3)
U7_ga(x1, x2, x3) = U7_ga(x3)
U8_ga(x1, x2, x3) = U8_ga(x3)
U9_ga(x1, x2, x3) = U9_ga(x3)
parse_out_ga(x1, x2) = parse_out_ga(x2)
PARSE_IN_GA(x1, x2) = PARSE_IN_GA(x1)
U5_GA(x1, x2, x3) = U5_GA(x3)
U4_GA(x1, x2, x3) = U4_GA(x3)
U7_GA(x1, x2, x3) = U7_GA(x3)
U8_GA(x1, x2, x3) = U8_GA(x3)
U1_GA(x1, x2, x3) = U1_GA(x3)
U2_GA(x1, x2, x3) = U2_GA(x3)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

U2_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B, C), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
U7_GA(Xs, T, app_out_aag(As, .(a, .(b, Bs)), Xs)) → U8_GA(Xs, T, app_in_gga(As, .(s(a, b), Bs), Ys))
U5_GA(Xs, T, app_out_gga(As, .(s(a, s(A, B), b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
U8_GA(Xs, T, app_out_gga(As, .(s(a, b), Bs), Ys)) → PARSE_IN_GA(Ys, T)
PARSE_IN_GA(Xs, T) → U1_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs))
PARSE_IN_GA(Xs, T) → U7_GA(Xs, T, app_in_aag(As, .(a, .(b, Bs)), Xs))
U4_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs)) → U5_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B), b), Bs), Ys))
U1_GA(Xs, T, app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))), Xs)) → U2_GA(Xs, T, app_in_gga(As, .(s(a, s(A, B, C), b), Bs), Ys))
PARSE_IN_GA(Xs, T) → U4_GA(Xs, T, app_in_aag(As, .(a, .(s(A, B), .(b, Bs))), Xs))

The TRS R consists of the following rules:

app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U10_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
app_in_aag([], X, X) → app_out_aag([], X, X)
app_in_aag(.(X, Xs), Ys, .(X, Zs)) → U10_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs))
U10_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U10_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) → app_out_aag(.(X, Xs), Ys, .(X, Zs))

The argument filtering Pi contains the following mapping:
app_in_aag(x1, x2, x3) = app_in_aag(x3)
app_out_aag(x1, x2, x3) = app_out_aag(x1, x2)
.(x1, x2) = .(x1, x2)
U10_aag(x1, x2, x3, x4, x5) = U10_aag(x1, x5)
a = a
s(x1, x2, x3) = s(x1, x2, x3)
b = b
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
[] = []
app_out_gga(x1, x2, x3) = app_out_gga(x3)
U10_gga(x1, x2, x3, x4, x5) = U10_gga(x1, x5)
s(x1, x2) = s(x1, x2)
PARSE_IN_GA(x1, x2) = PARSE_IN_GA(x1)
U5_GA(x1, x2, x3) = U5_GA(x3)
U4_GA(x1, x2, x3) = U4_GA(x3)
U7_GA(x1, x2, x3) = U7_GA(x3)
U8_GA(x1, x2, x3) = U8_GA(x3)
U1_GA(x1, x2, x3) = U1_GA(x3)
U2_GA(x1, x2, x3) = U2_GA(x3)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ RuleRemovalProof

Q DP problem:
The TRS P consists of the following rules:

PARSE_IN_GA(Xs) → U7_GA(app_in_aag(Xs))
U5_GA(app_out_gga(Ys)) → PARSE_IN_GA(Ys)
U4_GA(app_out_aag(As, .(a, .(s(A, B), .(b, Bs))))) → U5_GA(app_in_gga(As, .(s(a, s(A, B), b), Bs)))
PARSE_IN_GA(Xs) → U1_GA(app_in_aag(Xs))
PARSE_IN_GA(Xs) → U4_GA(app_in_aag(Xs))
U2_GA(app_out_gga(Ys)) → PARSE_IN_GA(Ys)
U8_GA(app_out_gga(Ys)) → PARSE_IN_GA(Ys)
U7_GA(app_out_aag(As, .(a, .(b, Bs)))) → U8_GA(app_in_gga(As, .(s(a, b), Bs)))
U1_GA(app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))))) → U2_GA(app_in_gga(As, .(s(a, s(A, B, C), b), Bs)))

The TRS R consists of the following rules:

app_in_gga([], X) → app_out_gga(X)
app_in_gga(.(X, Xs), Ys) → U10_gga(X, app_in_gga(Xs, Ys))
app_in_aag(X) → app_out_aag([], X)
app_in_aag(.(X, Zs)) → U10_aag(X, app_in_aag(Zs))
U10_gga(X, app_out_gga(Zs)) → app_out_gga(.(X, Zs))
U10_aag(X, app_out_aag(Xs, Ys)) → app_out_aag(.(X, Xs), Ys)

The set Q consists of the following terms:

app_in_gga(x0, x1)
app_in_aag(x0)
U10_gga(x0, x1)
U10_aag(x0, x1)

We have to consider all (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

U4_GA(app_out_aag(As, .(a, .(s(A, B), .(b, Bs))))) → U5_GA(app_in_gga(As, .(s(a, s(A, B), b), Bs)))
U8_GA(app_out_gga(Ys)) → PARSE_IN_GA(Ys)
U1_GA(app_out_aag(As, .(a, .(s(A, B, C), .(b, Bs))))) → U2_GA(app_in_gga(As, .(s(a, s(A, B, C), b), Bs)))

Used ordering: POLO with Polynomial interpretation [25]:

POL(.(x₁, x₂)) = 2 + x₁ + x₂
POL(PARSE_IN_GA(x₁)) = x₁
POL(U10_aag(x₁, x₂)) = 2 + x₁ + x₂
POL(U10_gga(x₁, x₂)) = 2 + x₁ + x₂
POL(U1_GA(x₁)) = x₁
POL(U2_GA(x₁)) = x₁
POL(U4_GA(x₁)) = x₁
POL(U5_GA(x₁)) = x₁
POL(U7_GA(x₁)) = x₁
POL(U8_GA(x₁)) = 1 + x₁
POL([]) = 0
POL(a) = 1
POL(app_in_aag(x₁)) = x₁
POL(app_in_gga(x₁, x₂)) = x₁ + x₂
POL(app_out_aag(x₁, x₂)) = x₁ + x₂
POL(app_out_gga(x₁)) = x₁
POL(b) = 1
POL(s(x₁, x₂)) = 1 + x₁ + x₂
POL(s(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

U5_GA(app_out_gga(Ys)) → PARSE_IN_GA(Ys)
PARSE_IN_GA(Xs) → U7_GA(app_in_aag(Xs))
PARSE_IN_GA(Xs) → U1_GA(app_in_aag(Xs))
PARSE_IN_GA(Xs) → U4_GA(app_in_aag(Xs))
U2_GA(app_out_gga(Ys)) → PARSE_IN_GA(Ys)
U7_GA(app_out_aag(As, .(a, .(b, Bs)))) → U8_GA(app_in_gga(As, .(s(a, b), Bs)))

The TRS R consists of the following rules:

app_in_gga([], X) → app_out_gga(X)
app_in_gga(.(X, Xs), Ys) → U10_gga(X, app_in_gga(Xs, Ys))
app_in_aag(X) → app_out_aag([], X)
app_in_aag(.(X, Zs)) → U10_aag(X, app_in_aag(Zs))
U10_gga(X, app_out_gga(Zs)) → app_out_gga(.(X, Zs))
U10_aag(X, app_out_aag(Xs, Ys)) → app_out_aag(.(X, Xs), Ys)

The set Q consists of the following terms:

app_in_gga(x0, x1)
app_in_aag(x0)
U10_gga(x0, x1)
U10_aag(x0, x1)

We have to consider all (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 6 less nodes.